北斗GEO卫星用户算法的改进方法研究*

针对北斗GEO用户算法需要进行5?倾角的坐标旋转处理这一过程,本文提出了采用经典广播星历参数用户算法直接解算北斗GEO卫星位置的改进方法,并同时给出了相应的基于第二类无奇点根数的广播星历拟合算法。该算法采用第二类无奇点轨道根数代替经典轨道根数,解决了由GEO轨道的小倾角特性引起的经典广播星历参数拟合过程中法化矩阵奇异的问题。从而避免了北斗GEO用户算法中坐标旋转处理过程,减少了GEO用户算法的计算步骤。经过仿真验证,本文提出的改进方法在卫星轨道拟合过程中与原算法精度相当;在卫星轨道外推过程中与原算法相比略有精度损失,但仍满足用户导航定位精度的需求。最后,采用实际北斗GEO星历解算的轨道数据验证了改进算法的有效性。     

基于DoDAF与Petri网的预警卫星系统建模分析

预警卫星系统在弹道导弹防御系统中处在最前沿,在战争中起着其他装备无法替代的作用。依据DoDAF和预警卫星系统的作战流程,构建了预警卫星系统作战状态转换(OV-6b)模型,以描述预警卫星系统作战过程的时序关系、各作战节点的状态转换以及信息流关系。基于Petri网将各节点OV-6b模型转换成可执行模型进行驱动,并构建和分析了各Petri网模型的可达图,结果表明,建立的OV-6b模型和Petri网模型是合理的、正确的。     

Maintenance scheduling for modular systems: Modeling and algorithms

We study new models of scheduled maintenance management for modular systems, consisting of multiple components with respective cycle limits. The cycle limit of each component specifies the time interval in which this component must be repaired or replaced. The goal is to compute a feasible maintenance schedule that minimizes the cost associated with component maintenance. Applications of these models arise in Air Force aircraft maintenance as well as in other arenas with required preventive maintenance. The typical cost structures that arise in practical settings are submodular, which make the resulting models computationally challenging. We develop two efficient and operationally tenable approximation algorithms. We prove constant factor worst‐case guarantees for both algorithms, and present computational experiments showing that these algorithms perform within a few percent of optimality on operationally relevant instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 472–488, 2014     

Scheduling twin robots on a line

This article introduces the twin robots scheduling problem (TRSP), in which two robots positioned at the opposite ends of a rail are required to deliver items to positions along the rail, and the objective is to minimize the makespan. A proof of ‐hardness of the TRSP is presented, along with exact and heuristic algorithms. Computational results on challenging instances are provided.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 119–130, 2014     

动态性警卫勤务卫星通信保障非技术性障碍及对策

卫星通信技术为警卫勤务的通信保障提供了可靠的技术平台,但临时现场、临时住地以及路线等动态性警卫勤务的通信保障问题一直没有得到较好地解决,动态性警卫勤务中应用卫星通信还存在着一些非技术层面的障碍。阐述了动态性警卫勤务运用卫星通信保障的必要性和可行性,分析了动态性警卫勤务卫星通信保障非技术性障碍,提出了消除动态性警卫勤务卫星通信保障非技术性障碍的对策。     

The quay crane scheduling problem with time windows

The quay crane scheduling problem consists of scheduling tasks for loading and unloading containers on cranes that are assigned to a vessel for its service. This article introduces a new approach for quay crane scheduling, where the availability of cranes at a vessel is restricted to certain time windows. The problem is of practical relevance, because container terminal operators frequently redeploy cranes among vessels to speed up the service of high‐priority vessels while serving low‐priority vessels casually. This article provides a mathematical formulation of the problem and a tree‐search‐based heuristic solution method. A computational investigation on a large set of test instances is used to evaluate the performance of the heuristic and to identify the impact of differently structured crane time windows on the achievable vessel handling time. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

多核系统中基于动态松弛时间回收的节能实时调度算法

许多嵌入式实时任务的实际执行时间往往小于最坏情况执行时间,因此可以产生大量的动态松弛时间.针对时限等于周期的偶发任务集,提出一种基于动态松弛时间回收的多核系统节能实时调度算法LRE-DVFS-ALL.该算法基于最优在线调度算法LRE-TL,利用TL面内节能实时调度思想,在每个TL面的提前完成时刻实现动态松弛时间回收,降...     

基于拉格朗日松弛的航天测控调度上界求解算法

通过分析航天测控调度问题的测控需求,建立了航天测控调度0-1整数规划模型,运用拉格朗日松弛方法对模型中的设备约束和卫星约束进行了松弛,运用次梯度优化算法求得了拉格朗日对偶问题的上界.最后,通过对两个场景的试验分析,证明了运用次梯度优化算法求得的上界的有效性.     

军事卫星支援下舰艇编队防空作战模型研究

为了赢得较长的防空反导预警时间,运用影响图理论方法建立了军事卫星支援下的舰艇编队防空作战模型.该模型着重研究了红方军事卫星的不同系统参数对敌对双方损耗系数的影响程度,充分论证了军事卫星在舰艇编队防空作战中的预警支援与通信支援作用.所叙述的内容为进一步深入研究舰艇编队防空作战提供了参考.     

A branch‐and‐cut algorithm for the quay crane scheduling problem in a container terminal

The quay crane scheduling problem consists of determining a sequence of unloading and loading movements for cranes assigned to a vessel in order to minimize the vessel completion time as well as the crane idle times. Idle times originate from interferences between cranes since these roll on the same rails and a minimum safety distance must be maintained between them. The productivity of container terminals is often measured in terms of the time necessary to load and unload vessels by quay cranes, which are the most important and expensive equipment used in ports. We formulate the quay crane scheduling problem as a vehicle routing problem with side constraints, including precedence relationships between vertices. For small size instances our formulation can be solved by CPLEX. For larger ones we have developed a branch‐and‐cut algorithm incorporating several families of valid inequalities, which exploit the precedence constraints between vertices. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006